Estimating the Number of Components in Gaussian Mixture Models Adaptively ⋆

نویسندگان

  • Conghua Xie
  • Jinyi Chang
  • Yongjun Liu
چکیده

An important but difficult problem of mixture model is estimating the number of components, k, by model selection criterion. We investigate the sum of weighted real and imaginary parts of all LogCharacteristic Functions (LCF) for Gaussian Mixture Model (GMM) and propose a new method to estimate k, adaptively. Our method defines the Sum of Weighted Real parts of all LCFs (SWRLCF) as a new convergent function and propose a new model selection criterion based on it. Our new model criterion makes use of the stability of the SWRLCF when k is larger than the true number of components. The univariate acidity and simulated 2D datasets are used to test. Experiment results suggest that our method without any priori is more suited for large sample applications than Akaike’s Information Criterion (AIC), AIC3, Bayesian Information Criterion (BIC) and the Stepwise Split and-merge EM (SSMEM) methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the number of Gaussian components in a mixture: an application to speaker verification tasks

Despite all advances in the speaker recognition domain, Gaussian Mixture Models (GMM) remain the state-of-the-art modeling technique in speaker recognition systems. The key idea is to approximate the probability density function ( ) of the feature vectors associated to a speaker with a weighted sum of Gaussian densities. Although the extremely efficient Expectation-Maximization (EM) algorithm c...

متن کامل

Negative Selection Based Data Classification with Flexible Boundaries

One of the most important artificial immune algorithms is negative selection algorithm, which is an anomaly detection and pattern recognition technique; however, recent research has shown the successful application of this algorithm in data classification. Most of the negative selection methods consider deterministic boundaries to distinguish between self and non-self-spaces. In this paper, two...

متن کامل

IMAGE SEGMENTATION USING GAUSSIAN MIXTURE MODEL

  Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we have learned Gaussian mixture model to the pixels of an image. The parameters of the model have estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image is made by Bayes rule. In fact, ...

متن کامل

­­Image Segmentation using Gaussian Mixture Model

Abstract: Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we used Gaussian mixture model to the pixels of an image. The parameters of the model were estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image was made by Bayes rule. In fact,...

متن کامل

Interactive Image Segmentation

Segmentation of objects from still images has many practical applications. In the past decade, combinatorial graph cut algorithms have been successfully applied to get fairly accurate object segmentation, along with considerable reduction in the amount of user interaction required. In particular, the Grabcut algorithm has been found to provide satisfactory results for a wide variety of images. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013